approximate kernels meaning in Chinese

近似核

To obtain the fast matrix - vector multiplication algorithm , we approximate the kernel function with piece - wise polynomial and get the approximate coefficient matrix a using the approximate kernel function . let n be the number of quadrature points and k2 be the number of interpolating knots at each subdomain . it is proved that the construction of a and the matrix - vector multiplication ax require o ( nk ) operations respectively
我们利用对核函数进行分片多项式插值逼近得到适用于快速方法的近似系数矩阵a ：矩阵a的计算和矩阵-向量相乘ax各需要o ( nk )次运算，存贮a需要占用o ( nk )内存，其中n为积分节点的个数， k ~ 2为每个小区域的插值节点数。